Pushing the Limits for Judgmental Consistency: Comparing Random Weighting Schemes with Expert Judgments
نویسندگان
چکیده
منابع مشابه
Judgmental Reasoning for Expert Systems
We present a new system for plausible reasoning in expert systems. It is an extension of the Horn clause subset of first order logic, and is distinguished by its use of non-numeric certainties and the assignment of certainties to logical formulae rather than events. Model theoretic and ftxpoint semantics are sketched for this language. An implementation in the logic programming language Prolog ...
متن کاملPushing the limits of crystallography
A very serious concern of scientists dealing with crystal structure refinement, including theoretical research, pertains to the characteristic bias in calculated versus measured diffraction intensities, observed particularly in the weak reflection regime. This bias is here attributed to corrective factors for phonons and, even more distinctly, phasons, and credible proof supporting this assumpt...
متن کاملPushing the limits of SPM
Breaking the speed limit One of the serious, inherent limitations in all forms of SPM is the low imaging rate. This is because each image is built up pixel by pixel in a sequential scan of the surface. The scanning motion involves electronically controlled mechanical displacements, and usually some form of feedback is applied between a control parameter, such as tunneling current or force, and ...
متن کاملAutomated Trading with Boosting and Expert Weighting
We propose a multi-stock automated trading system that relies on a layered structure consisting of a machine learning algorithm, an online learning utility, and a risk management overlay. Alternating decision tree (ADT), which is implemented with Logitboost, was chosen as the underlying algorithm. One of the strengths of our approach is that the algorithm is able to select the best combination ...
متن کاملPushing the Limits in Sequential Sorting
With re nements to the WEAK-HEAPSORT algorithm we establish the general and practical relevant sequential sorting algorithm RELAXED-WEAK-HEAPSORT executing exactly ndlog ne 2 ne + 1 n log n 0:9n comparisons on any given input. The number of transpositions is bounded by n plus the number of comparisons. Experiments show that RELAXED-WEAK-HEAPSORT only requires O(n) extra bits. Even if this space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Personnel Assessment and Decisions
سال: 2020
ISSN: 2377-8822
DOI: 10.25035/pad.2020.02.002